Nodes self-scheduling approach for maximising wireless sensor network lifetime based on remaining energy

Coverage and energy conservation are two major issues in wireless sensor networks (WSNs), especially when sensors are randomly deployed in large areas. In such WSNs, sensors are equipped with limited lifetime batteries and redundantly cover the target area. To face the short lifetime of the WSN, the objective is to optimize energy consumption while maintaining the full sensing coverage. A major technique to save the energy is to use a wake-up scheduling protocol through which some nodes stay active whereas the others enter sleep state so as to conserve their energy. This study presents an original algorithm for node Self scheduling to decide which ones have to switch to the sleep state. The novelty is to take into account the remaining energy at every node in the decision of turning off redundant nodes. Hence, the node with a low remaining energy has priority over its neighbors to enter sleep state. The decision is based on a local neighborhood knowledge that minimizes the algorithm overhead. To verify and evaluate the proposed algorithm, simulations have been conducted and have shown that it can contribute to extend the network lifetime. A comparison with existing works is also presented and the performance gains are highlighted. Existing Method • The wireless sensor networks are mainly used in critical environments such as industries, military applications. • The sensor nodes are equipped with limited energy resources such as battery. • The sensor nodes need to consume the energy for sending / receiving/ sensing activities. • Higher energy consumption leads the nodes into sleep state. (the state with low residual energy). • At sleep state, the nodes cannot send / receive/ sense the data and cannot perform in routing. • The wake-up scheduling protocols are used to preserve the nodes from entering into sleep state earlier. • These protocols used ON / OFF technique to put the node in one of these modes respective of their residual energy. • The nodes with low residual energy are put into OFF mode for a while to conserve its energy. • But this technique leads to severe coverage issues where the nodes were put into OFF state. And this technique also leads to connectivity issues in the network. Proposed Solution • Here, we propose an algorithm called Energy remaining greedy scheduling (ERGS) algorithm. • This algorithm uses wake-up protocol with selfscheduling algorithm. • The self-scheduling phase considered of the following two rounds. o Advertisement step o Eligibility step • In advertisement step, each node transmits to its neighbour nodes an advertisement message (ADV), including its ID and its current remaining energy. • When receiving an ADV message, the receiver node will compare the current residual energy to the transmitter node. • If the current energy is higher than the transmitter node, the node is specified as HCS list. Otherwise specified into LCS list. • The nodes belonging to the HCS list have less priority than the receiver node to be deactivated. • The nodes belonging to the LCS list have more priority to be deactivated. • In eligibility step, based on the results obtained in advertisement step the nodes are put into sleep state with Timestamp (Ts). After the Ts expired, the nodes are awakening into active state. [Selvam, 2(4): April, 2013] ISSN: 2277-9655 http: // www.ijesrt.com (C) International Journal of Engineering Sciences & Research Technology [1007-1012] Hardware Specification PROCESSOR : PENTIUM IV CLOCK SPEED : 1.7 GHZ RAM CAPACITY : 1 GB HARD DISK DRIVE : 80 GB CACHE MEMORY : 1 MB VIRTUAL MEMORY : 512 MB CD ROM : 52X LG POINTING DEVICE : LOGITECH MOUSE KEYBOARD : 104 KEYS MONITOR : 15” VGA COLOR CABINET : ATX Software Specification CROSS PLATFORM : VMWARE PROTOCOL DESIGN : AODV LANGUAGE : TCL/TK,OTCL SIMULATOR VERSION : NS-2.28 OPERATING SYSTEM : REDHAT LINUX 9.0 GRAPH TOOL : GNUPLOT